Privacy-Cost Trade-offs in Demand-Side Management With Storage
نویسندگان
چکیده
منابع مشابه
Optimal Demand-Side Management for Joint Privacy-Cost Optimization with Energy Storage
The smart meter (SM) privacy problem is addressed together with the cost of energy for the consumer. It is assumed that a storage device, e.g., an electrical battery, is available to the consumer, which can be utilized both to achieve privacy and to reduce the energy cost by modifying the energy consumption profile. Privacy is measured via the squared-error distortion between the SM readings, w...
متن کاملPrivacy trade-offs in web-based services
Recent developments in networking and storage technology have led to the dissemination of information over many different sources such as personal computers or corporate and public databases. As these information sources are often distributed and heterogeneous, effective tools for data collection and integration have been developed in parallel. These tools are employed e.g. in library search ca...
متن کاملEnergy-Privacy Trade-Offs in VLSI Computations
VLSI circuits are open to sidechannel attacks which disclose information about its internal state to an adversary. Privacy is a design attribute to quantify the circuit’s resistance and resilience to sidechannel attacks. There has been some recent work in cryptography to capture the notion of privacy in circuits. Several constructions to transform a circuit into a private circuit have also been...
متن کاملEffects of Risk on Privacy Contracts for Demand-Side Management
As smart meters continue to be deployed around the world collecting unprecedented levels of fine-grained data about consumers, we need to find mechanisms that are fair to both, (1) the electric utility who needs the data to improve their operations, and (2) the consumer who has a valuation of privacy but at the same time benefits from sharing consumption data. In this paper we address this prob...
متن کاملTime and Cost Trade-Offs in Gossiping
Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pair learns all values currently known to the other. Two important criteria of efficiency of a gossiping algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2017
ISSN: 1556-6013,1556-6021
DOI: 10.1109/tifs.2017.2656469